Noiseless Data Compression with Low-Density Parity-Check Codes
نویسندگان
چکیده
This paper presents a new approach to universal noiseless compression based on error correcting codes. The scheme is based on the concatenation of the Burrows-Wheeler block sorting transform (BWT) with the syndrome former of a Low-Density Parity-Check (LDPC) code. The proposed scheme has linear encoding and decoding times and uses a new closed-loop iterative doping algorithm that works in conjunction with belief-propagation decoding. Unlike the leading data compression methods our method is resilient against errors, and lends itself to joint source-channel encoding/decoding; furthermore it offers very competitive data compression performance.
منابع مشابه
Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملOn Blind Compression of Encrypted Data Approaching the Source
Traditional data transmission over an insecure noiseless channel consists of first compressing data for efficiency and then encrypting it for security. Reversing the order of these operations is considered in Johnson et al. The central realization is that while the raw and encrypted data are statistically independent, the encrypted data and key sequence are not. If distributed source coding tec...
متن کاملA coding theorem for lossy data compression by LDPC codes
In this correspondence, low-density parity-check (LDPC) codes are applied to lossy source coding and we study how the asymptotic performance of MacKay’s LDPC codes depends on the sparsity of the parity-check matrices in the source coding of the binary independent and identically distributed (i.i.d.) source with Pr = 1 = 0 5. In the sequel, it is shown that an LDPC code with column weight (log )...
متن کاملLossless Data Compression with Error Correcting Codes
Existing zero-error variable-length data compression algorithms suffer from sensitivity to transmission errors and error propagation across packets when used in packet-based data transmission through noisy channels. We propose a new approach to lossless data compression based on error correcting codes and the block-sorting transform. It has long been recognized that linear source codes achieve ...
متن کاملOn Blind Compression of Encrypted Correlated Data Approaching The Source Entropy Rate∗
Traditional data transmission over an insecure noiseless channel consists of first compressing data for efficiency and then encrypting it for security. Reversing the order of these operations is considered in Johnson et al. [1]. The central realization is that while the raw and encrypted data are statistically independent, the encrypted data and key sequence are not. If distributed source codin...
متن کامل